An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships

A Shortest Path Heuristic for Evaluating the Quality of Stowage Plans in Roll-On Roll-Off Liner Shipping

Rudder roll stabilization for ships

Advanced control algorithms using LQG and adaptive control techniques enable the design of an economically attractive alternative for conventional fin stabilizers and have proved to be robust during simulation experiments and full-scale trials. Abstract-This paper describes the design of an autopilot for rudder roll stabilization for ships. This autopilot uses the rudder not only for course kee...

An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

The pickup and delivery problem with time windows is the problem of serving a number of transportation requests using a limited amount of vehicles. Each request involves moving a number of goods from a pickup location to a delivery location. Our task is to construct routes that visit all locations such that corresponding pickups and deliveries are placed on the same route and such that a pickup...

An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem

The Cumulative Capacitated Vehicle Routing Problem (CCVRP) is a variation of the classical Capacitated Vehicle Routing Problem in which the objective is the minimization of the sum of arrival times at customers, instead of the total routing cost. This paper presents an adaptive large neighborhood search heuristic for the CCVRP. This algorithm is applied to a set of benchmark instances and compa...

An adaptive large neighborhood search heuristic for the share-a-ride problem

The Share-a-Ride Problem (SARP) aims at maximizing the profit of serving a set of passengers and parcels using a set of homogeneous vehicles. We propose an adaptive large neighborhood search (ALNS) heuristic to address the SARP. Furthermore, we study the problem of determining the time slack in a SARP schedule. Our proposed solution approach is tested on three sets of realistic instances. The p...